Exact Online String Matching Bibliography
نویسنده
چکیده
In this short note we present a comprehensive bibliography for the online exact string matching problem. The problem consists in finding all occurrences of a given pattern in a text. It is an extensively studied problem in computer science, mainly due to its direct applications to such diverse areas as text, image and signal processing, speech analysis and recognition, data compression, information retrieval, computational biology and chemistry. Since 1970 more than 120 string matching algorithms have been proposed. In this note we present a comprehensive list of (almost) all string matching algorithms. The list is updated to May 2016.
منابع مشابه
Towards Faster String Matching
Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Hannu Peltola Name of the doctoral dissertation Towards Faster String Matching Publisher Aalto University School of Science Unit Department of Computer Science Series Aalto University publication series DOCTORAL DISSERTATIONS 78/2013 Field of research Software Technology Manuscript submitted 11 December 2012 Date of the defenc...
متن کاملOn-line String Matching in Highly Similar DNA Sequences
We consider the problem of on-line exact string matching of a pattern in a set of highly similar sequences. This can be useful in cases where indexing the sequences is not feasible. We present a preliminary study by restricting the problem for a specific case where we adapt the classical Morris-Pratt algorithm to consider borders with errors. We give an original algorithm for computing borders ...
متن کاملEvaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences
With the availability of large amounts of dna data, exact matching of nucleotide sequences has become an important application in modern computational biology and in meta-genomics. In the last decade several efficient solutions for the exact string matching problem have been developed and most of them are very fast in practical cases. However when the length of the pattern is short or the alpha...
متن کاملThe Exact String Matching Problem: a Comprehensive Experimental Evaluation
This paper addresses the online exact string matching problem which consists in finding all occurrences of a given pattern p in a text t. It is an extensively studied problem in computer science, mainly due to its direct applications to such diverse areas as text, image and signal processing, speech analysis and recognition, data compression, information retrieval, computational biology and che...
متن کاملExact String Matching Animation in Java
We present an animation in Java for exact string matching algorithms 3]. This system provides a framework to animate in a very straightforward way any string matching algorithm which uses characters comparisons. Already 27 string matching algorithms have been animated with this system. It is a good tool to understand all these algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1605.05067 شماره
صفحات -
تاریخ انتشار 2016